Math. Program., Ser. A manuscript No. (will be inserted by the editor) An Exact Combinatorial Algorithm for Minimum Graph Bisection Daniel Delling · Daniel Fleischman ·

Source URL: www.ilyaraz.org

• Spanning tree
• NP-complete problems
• Network flow
• Routing algorithms
• Graph
• Tree decomposition
• Bridge
• Tree
• Flow network
• Graph theory
• Mathematics
• Theoretical computer science

Single Pass Spectral Sparsification in Dynamic Streams Michael Kapralov MIT Yin Tat Lee

Source URL: people.csail.mit.edu

• Spanning tree
• NP-complete problems
• Algebraic graph theory
• Combinatorial optimization
• Matching
• Laplacian matrix
• Minimum spanning tree
• Connectivity
• Planar separator theorem
• Graph theory
• Mathematics
• Theoretical computer science

Defensive Leakage Camouflage E. Brier1 , Q. Fortier2 , R. Korkikian3,4 , K. W. Magld5 D. Naccache2,4 , G. Ozari de Almeida3,4 , A. Pommellet2 A. H. Ragab5 , and J. Vuillemin2,5 1 Ingenico

Source URL: eprint.iacr.org

• Elementary geometry
• Differential topology
• Sphere
• Surfaces
• Topology
• Geometry
• Mathematics
• Spanning tree

Computing A Minimal Spanning Tree Gary D. Knott, Ph.D. Civilized Software, IncHeritage Park Circle Silver Spring, MDUSA Tel

Source URL: www.civilized.com

THE DFX1000-12/24G IS A RUGGEDIZED, FEATURE RICH, HIGH PERFORMANCE LAYER 2 ETHERNET SWITCH SPECIFICALLY DESIGNED TO MEET THE HARSH ENVIRONMENTAL CONDITIONS PREVALENT IN TRANSMISSION AND DISTRIBUTION SUBSTATIONS. DFX1000-

Source URL: www.avaratechnologies.com

• Computing
• IEEE 802
• Working groups
• Network topology
• IEEE 802.1Q
• Virtual LAN
• Spanning Tree Protocol
• IEEE 802.3
• Network switch
• Ethernet
• OSI protocols
• Network architecture

Solving Large, Irregular Graph Problems using Adaptive Work-stealing Guojing Cong (IBM) Sreedhar Kodali (IBM) Sriram Krishnamoorthy (Ohio State) Doug Lea (SUNY Oswego) Vijay Saraswat (IBM)

Source URL: gee.cs.oswego.edu

• Search algorithms
• Spanning tree
• Depth-first search
• Breadth-first search
• Minimum spanning tree
• Planar graph
• Cilk
• Graph traversal
• Ear decomposition
• Graph theory
• Mathematics
• Theoretical computer science

Homework Eight, for Fri[removed]CSE[removed]Problems from the book: 3.28, 4.22, 5.1, 5.4, [removed]The cut property makes it possible to construct minimum spanning trees greedily, for instance by using

Source URL: cseweb.ucsd.edu

• Theoretical computer science
• Minimum spanning tree
• Algorithm
• Distributed minimum spanning tree
• Reverse-delete algorithm
• Spanning tree
• Mathematics
• Graph theory

Abstracts Manuel Bodirsky, Ecole Polytechnique The Product Ramsey Theorem in Constraint Satisfaction Complexity In this talk, I show how the product Ramsey theorem can be used jointly with tools from universal algebra to

Source URL: asz.informatik.hu-berlin.de

• Planar graphs
• Graph coloring
• NP-complete problems
• Matching
• Tree decomposition
• Edge coloring
• Clique
• Minimum spanning tree
• Shortest path problem
• Graph theory
• Theoretical computer science
• Graph operations

c 2013 Kyle J. Fox FAST ALGORITHMS FOR SURFACE EMBEDDED GRAPHS VIA HOMOLOGY

Source URL: web.engr.illinois.edu

• Combinatorial optimization
• Network theory
• Shortest path problem
• Planar graph
• Minimum cut
• Induced path
• Directed acyclic graph
• Minimum spanning tree
• Algorithm
• Graph theory
• Mathematics
• Theoretical computer science

Relational Approach for Shortest Path Discovery over Large Graphs Jun Gao† Ruoming Jin§ Jiashuai Zhou† Jeffrey Xu Yu‡ Xiao Jiang† Tengjiao Wang† † ‡

Source URL: vldb.org

• Search algorithms
• Network theory
• Routing algorithms
• Shortest path problem
• Breadth-first search
• Tree
• Graph
• Flow network
• Minimum spanning tree
• Mathematics
• Graph theory
• Theoretical computer science